Justifying Proofs using Memo Tables
نویسنده
چکیده
منابع مشابه
Justification Based on Program Transformation
Justification is to give evidence, in terms of a proof, for the truth value of the result generated by query evaluation of a logic program. In an earlier work we presented algorithms for justifying logic programs. It was based on using tabling for evaluating the program and post-processing the memo tables created during evaluation. Justification built in this fashion does not compromise the per...
متن کاملThe Organization of Lookup Tables in Instruction Memoization
Instruction Memoization is a technique that enables performing multiple-cycle computations in a single cycle by exploiting redundant instructions. The technique is based on the notion of memoing: saving the input and output of previous calculations and using the output if the input is encountered again. Several recent papers have proven that non-trivial speedup (over 10%) can be obtained by usi...
متن کاملDisposable Memo Functions
We formalize the meaning of lazy memo-functions in Haskell with an extension to the lazy-calculus, Haskell's computational model. The semantics enable reasoning about memo-ization's eeect on space and time complexity. Based on the semantics, we present a prototype implementation that requires no changes to the garbage-collector; memo-tables are simply reclaimed when no references to them remain.
متن کاملJustifying Equality
We consider the problem of finding irredundant bases for inconsistent sets of equalities and disequalities. These are subsets of inconsistent sets which do not contain any literals which do not contribute to the unsatisfiability in an essential way, and can therefore be discarded. The approach we are pursuing here is to decorate derivations with proofs and to extract irredundant sets of assumpt...
متن کاملIncorporating Tables into Proofs
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we shall call the collection of such previously proved results a table and use a partial order on the table’s entries to denote the (provability) dependency relationship between tabled items. Tables can arise in a number of situations: in automated deduction v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000